全文获取类型
收费全文 | 690篇 |
免费 | 40篇 |
国内免费 | 78篇 |
专业分类
化学 | 10篇 |
晶体学 | 1篇 |
力学 | 17篇 |
综合类 | 22篇 |
数学 | 728篇 |
物理学 | 30篇 |
出版年
2023年 | 1篇 |
2022年 | 12篇 |
2021年 | 10篇 |
2020年 | 7篇 |
2019年 | 20篇 |
2018年 | 18篇 |
2017年 | 10篇 |
2016年 | 15篇 |
2015年 | 9篇 |
2014年 | 23篇 |
2013年 | 51篇 |
2012年 | 31篇 |
2011年 | 21篇 |
2010年 | 35篇 |
2009年 | 41篇 |
2008年 | 50篇 |
2007年 | 47篇 |
2006年 | 56篇 |
2005年 | 31篇 |
2004年 | 39篇 |
2003年 | 35篇 |
2002年 | 31篇 |
2001年 | 31篇 |
2000年 | 33篇 |
1999年 | 29篇 |
1998年 | 34篇 |
1997年 | 20篇 |
1996年 | 16篇 |
1995年 | 5篇 |
1994年 | 6篇 |
1993年 | 8篇 |
1992年 | 2篇 |
1991年 | 1篇 |
1990年 | 3篇 |
1989年 | 9篇 |
1988年 | 3篇 |
1987年 | 3篇 |
1986年 | 4篇 |
1985年 | 2篇 |
1984年 | 2篇 |
1982年 | 1篇 |
1980年 | 2篇 |
1979年 | 1篇 |
排序方式: 共有808条查询结果,搜索用时 46 毫秒
11.
The gradual covering location problem seeks to establish facilities on a network so as to maximize the total demand covered, allowing partial coverage. We focus on the gradual covering location problem when the demand weights associated with nodes of the network are random variables whose probability distributions are unknown. Using only information on the range of these random variables, this study is aimed at finding the “minmax regret” location that minimizes the worst-case coverage loss. We show that under some conditions, the problem is equivalent to known location problems (e.g. the minmax regret median problem). Polynomial time algorithms are developed for the problem on a general network with linear coverage decay functions. 相似文献
12.
Jonathan Wang 《Journal of Combinatorial Theory, Series A》2011,118(2):365-372
Minimally nonideal matrices are a key to understanding when the set covering problem can be solved using linear programming. The complete classification of minimally nonideal matrices is an open problem. One of the most important results on these matrices comes from a theorem of Lehman, which gives a property of the core of a minimally nonideal matrix. Cornuéjols and Novick gave a conjecture on the possible cores of minimally nonideal matrices. This paper disproves their conjecture by constructing a new infinite family of square minimally nonideal matrices. In particular, we show that there exists a minimally nonideal matrix with r ones in each row and column for any r?3. 相似文献
13.
引入了拓扑覆盖的概念,并结合最小描述元对有限论域上的拓扑覆盖加于研究,得出了拓扑覆盖的最简覆盖和基与最小描述元之间的关系.介绍了在基于有限论域U上的覆盖,构造U上的一个拓扑的方法.并且在最小描述元的基础上将划分下的粗糙隶属函数推广至一般覆盖下的粗糙隶属函数,而后介绍了其相关运用. 相似文献
14.
本文研究在自然扩张和嵌入下特殊线性群和一般线性群的有限子群的McKay 箭图间的关系. 我们证明在特定条件下, 一般线性群GL(m;C) 的有限子群G的McKay 箭图是其正规子群G∩SL(m;C)的McKay 箭图的正则覆盖, 而当把G 嵌入SL(m+1;C) 时, 新的McKay 箭图由在原来的McKay 箭图的每一顶点加上一个由其Nakayama 平移到其自身的箭向得到. 作为例子, 我们指出如何用这些方法得到一些有趣的McKay 箭图. 相似文献
15.
George Voutsadakis 《Mathematical Logic Quarterly》2009,55(1):51-67
The notion of an ? ‐matrix as a model of a given π ‐institution ? is introduced. The main difference from the approach followed so far in Categorical Abstract Algebraic Logic (CAAL) and the one adopted here is that an ? ‐matrix is considered modulo the entire class of morphisms from the underlying N ‐algebraic system of ? into its own underlying algebraic system, rather than modulo a single fixed (N,N ′)‐logical morphism. The motivation for introducing ? ‐matrices comes from a desire to formulate a correspondence property for N ‐protoalgebraic π ‐institutions closer in spirit to the one for sentential logics than that considered in CAAL before. As a result, in the previously established hierarchy of syntactically protoalgebraic π ‐institutions, i. e., those with an implication system, and of protoalgebraic π ‐institutions, i. e., those with a monotone Leibniz operator, the present paper interjects the class of those π ‐institutions with the correspondence property, as applied to ? ‐matrices. Moreover, this work on ? ‐matrices enables us to prove many results pertaining to the local deduction‐detachment theorems, paralleling classical results in Abstract Algebraic Logic formulated, first, by Czelakowski and Blok and Pigozzi. Those results will appear in a sequel to this paper. (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim) 相似文献
16.
The Zhang–Zhang polynomial (i.e., Clar covering polynomial) of hexagonal systems is introduced by H. Zhang and F. Zhang, which
can be used to calculate many important invariants such as the Clar number, the number of Kekulé structures and the first
Herndon number, etc. In this paper, we give out an explicit recurrence expression for the Zhang–Zhang polynomials of the cyclo-polyphenacenes,
and determine their Clar numbers, numbers of Kekulé structures and their first Herndon numbers. 相似文献
17.
何家莉 《纯粹数学与应用数学》2019,35(2):229-234
利用一般映射研究了覆盖近似空间的一些性质,并证明了一些结论.接着定义了覆盖空间的粗糙连续映射及粗糙同胚映射.最后在覆盖粗糙连续映射和覆盖粗糙同胚映射的条件下,研究了两个覆盖近似空间的有关性质,进而在某种程度上为覆盖近似空间的分类提供了理论依据. 相似文献
18.
Yu Qing Chen 《Designs, Codes and Cryptography》1999,17(1-3):69-72
Recently Davis and Jedwab introduced the notion of covering extended building sets to construct abelian difference sets. In this paper we consider a family of covering extended building sets similar to the ones corresponding to Hadamard difference sets and Spence difference sets and derive some numerical restrictions on the parameters. 相似文献
19.
Hirobumi Mizuno 《Linear and Multilinear Algebra》2013,61(7):927-940
We give a decomposition formula for the determinant det(I ? U(λ)) of the weighted bond scattering matrix U(λ) of a regular covering of G. Furthermore, we define an L-function of G, and give a determinant expression of it. As a corollary, we express some determinant of the weighted bond scattering matrix of a regular covering of G by means of its L-functions. 相似文献
20.
The learning approach of empirical risk minimization (ERM) is taken for the regression problem in the least square framework.
A standard assumption for the error analysis in the literature is the uniform boundedness of the output sampling process.
In this paper we abandon this boundedness assumption and conduct error analysis for the ERM learning algorithm with unbounded
sampling processes satisfying an increment condition for the moments of the output. The key novelty of our analysis is a covering
number argument for estimating the sample error. 相似文献